A Note on Graphs with 2 Bends
نویسنده
چکیده
We show NP-completeness for the recognition problem of classical 2-
منابع مشابه
On the Total Number of Bends for Planar Octilinear Drawings
An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at 45◦ line-segments. For such drawings to be readable, special care is needed in order to keep the number of bends small. As the problem of finding planar octilinear drawings of minimum number of bends is NP-hard [16], in this paper we focus on upper and lower bounds. F...
متن کاملA note on simultaneous embedding of planar graphs
Let G1 and G2 be a pair of planar graphs such that V (G1) = V (G2) = V . A simultaneous embedding [6] Ψ = (Γ1,Γ2) of G1 and G2 is a pair of crossing-free drawings Γ1 and Γ2 of G1 and G2, respectively, such that for every vertex v ∈ V we have Γ1(v) = Γ2(v). If every edge e ∈ E(G1) ∩ E(G2) is represented with the same simple open Jordan curve both in Γ1 and in Γ2 we say that Ψ is a simultaneous e...
متن کاملA Pairing Technique for Area-eecient Orthogonal Drawings ? (extended Abstract)
An orthogonal drawing of a graph is a drawing such that vertices are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our rst algorithm needs area no greater than 0:76n 2 , and introduces n...
متن کاملA Better Heuristic for Orthogonal Graph Drawings
16 We end this paper by mentioning some open problems and directions for further research: Valiant proved that a grid-area of (n 2) is necessary for drawing non-planar graphs, since the crossing number can be (n 2) 26]. However, the involved constants are very small. For planar graphs (crossing number 0) a drawing with grid-area O(n log 2 n) is possible 14, 26], and the best known lower bound i...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1510.00684 شماره
صفحات -
تاریخ انتشار 2015